Group-invariant Percolation on Graphs

نویسندگان

  • I. Benjamini
  • R. Lyons
  • Y. Peres
  • O. Schramm
چکیده

Let G be a closed group of automorphisms of a graph X. We relate geometric properties of G and X, such as amenability and unimodularity, to properties of G-invariant percolation processes on X, such as the number of infinite components, the expected degree, and the topology of the components. Our fundamental tool is a new masstransport technique that has been occasionally used elsewhere and is developed further here. Perhaps surprisingly, these investigations of group-invariant percolation produce results that are new in the Bernoulli setting. Most notably, we prove that critical Bernoulli percolation on any nonamenable Cayley graph has no infinite clusters. More generally, the same is true for any nonamenable graph with a unimodular transitive automorphism group. We show that G is amenable iff for all α < 1, there is a G-invariant site percolation process ω on X with P[x ∈ ω] > α for all vertices x and with no infinite components. When G is not amenable, a threshold α < 1 appears. An inequality for the threshold in terms of the isoperimetric constant is obtained, extending an inequality of Häggström for regular trees. If G acts transitively on X, we show that G is unimodular iff the expected degree is at least 2 in any G-invariant bond percolation on X with all components infinite. The investigation of dependent percolation also yields some results on automorphism groups of graphs that do not involve percolation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds for the return probability of the delayed random walk on finite percolation clusters in the critical case

By an eigenvalue comparison-technique[16], the expected return probability of the delayed random walk on the finite clusters of critical Bernoulli bond percolation on the two-dimensional Euclidean lattice is estimated. The results are generalised to invariant percolations on unimodular graphs with almost surely finite clusters. A similar method has been used elsewhere[17] to derive bounds for i...

متن کامل

Critical Percolation on Any Nonamenable Group Has No Innnite Clusters

We show that independent percolation on any Cayley graph of a nonamenable group has no innnite components at the critical parameter. This result was obtained in Benjamini, Lyons, Peres, and Schramm (1997) as a corollary of a general study of group-invariant percolation. The goal here is to present a simpler self-contained proof that easily extends to quasi-transitive graphs with a unimodular au...

متن کامل

Bounds for the annealed return probability on large finite percolation graphs ∗

Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation and the associated heavy-tailed cluster size distributions. The upper bound relies on the fact that cartesian products of finite graphs with cycles of a certai...

متن کامل

Ja n 20 09 Bounds for the return probability of the delayed random walk on finite percolation clusters in the critical case

By an eigenvalue comparison-technique[20], the expected return probability of the delayed random walk on critical Bernoulli bond percolation clusters on the twodimensional Euclidean lattice is estimated. The results are generalised to invariant percolations on unimodular graphs with almost surely finite clusters. The approach involves using the special property of cartesian products of finite g...

متن کامل

Unimodular random trees

We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to give a new proof that URTs are sofic, a result of Elek. We show that ends of invariant forests in the hyperbolic plane converge to ideal boundary points. We...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999